People Re-Identification with Local Distance Comparison Using Learned Metric

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relaxed Pairwise Learned Metric for Person Re-identification

Matching persons across non-overlapping cameras is a rather challenging task. Thus, successful methods often build on complex feature representations or sophisticated learners. A recent trend to tackle this problem is to use metric learning to find a suitable space for matching samples from different cameras. However, most of these approaches ignore the transition from one camera to the other. ...

متن کامل

Nonlinear Local Metric Learning for Person Re-identification

Person re-identification aims at matching pedestrians observed from non-overlapping camera views. Feature descriptor and metric learning are two significant problems in person re-identification. A discriminative metric learning method should be capable of exploiting complex nonlinear transformations due to the large variations in feature space. In this paper, we propose a nonlinear local metric...

متن کامل

Superpixel Graph Label Transfer with Learned Distance Metric

We present a fast approximate nearest neighbor algorithm for semantic segmentation. Our algorithm builds a graph over superpixels from an annotated set of training images. Edges in the graph represent approximate nearest neighbors in feature space. At test time we match superpixels from a novel image to the training images by adding the novel image to the graph. A move-making search algorithm a...

متن کامل

Person Re-Identification Using Kernel-Based Metric Learning Methods

Re-identification of individuals across camera networks with limited or no overlapping fields of view remains challenging in spite of significant research efforts. In this paper, we propose the use, and extensively evaluate the performance, of four alternatives for re-ID classification: regularized Pairwise Constrained Component Analysis, kernel Local Fisher Discriminant Analysis, Marginal Fish...

متن کامل

Reduced-Rank Local Distance Metric Learning

Y. Huang acknowledges partial support from a UCF Graduate College Presidential Fellowship and National Science Foundation (NS F) grant No. 1200566. C. Li acknowledges partial support from NSF grants No. 0806931 and No. 0963146. M. Georgiopoulos acknowledges partial support from NSF grants No. 1161228 and No. 0525429. G. G. Anagnostopoulos acknowledges partial support from NSF grant No. 1263011....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Information and Systems

سال: 2014

ISSN: 0916-8532,1745-1361

DOI: 10.1587/transinf.2013edp7424